Monotonic Optimization of Dataflow Buffer Sizes
نویسندگان
چکیده
منابع مشابه
Optimization of Buffer Sizes in Assembly Systems Using Intelligent Techniques
When the systems under investigation are complex, the analytical solutions to these systems become impossible. Because of the complex stochastic characteristics of the systems, simulation can be used as an analysis tool to predict the performance of an existing system or a design tool to test new systems under varying circumstances. However, simulation is extremely time consuming for most probl...
متن کاملDataflow Optimization Made Simple
We present a Haskell library that makes it easy for compiler writers to implement program transformations based on dataflow analyses. The compiler writer must identify (a) a family of logical assertions on which the transformation will be based; (b) an approximate representation of such assertions, which must have a lattice structure such that every assertion can be increased at most finitely m...
متن کاملDiscrete Monotonic Global Optimization
Recently a general mathematical framework has been developed [3] for studying mathematical programming problems described by means of increasing functions, or more generally, differences of increasing functions. It has been shown in [3] that any mathematical programming problem of this class can be reduced to an equivalent problem of the following form, called canonical monotonic optimization p...
متن کاملHoopl: Dataflow Optimization Made Simple
We present Hoopl, a Haskell library that makes it easy for compiler writers to implement program transformations based on dataflow analyses. The compiler writer must identify (a) logical assertions on which the transformation will be based; (b) a representation of such assertions, which should form a lattice of finite height; (c) transfer functions that approximate weakest preconditions or stro...
متن کاملBuffer Minimization In RTL Synthesis From Coarse-grained Dataflow Specification
This paper concerns area-efficient automatic hardware architecture synthesis and its optimization from dataflow graph(DFG) specification for fast HW/SW cosynthesis. A node in a DFG represents a coarse grain computation block such as FIR and DCT and a port in a block may consume multiple data samples per invocation, which distinguishes our approach from conventional behavioral synthesis and comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Signal Processing Systems
سال: 2018
ISSN: 1939-8018,1939-8115
DOI: 10.1007/s11265-018-1415-2